منابع مشابه
Polynomial Time Uniform Word Problems
We have two polynomial time results for the uniform word problem for a quasivariety Q: (a) The uniform word problem for Q can be solved in polynomial time iff one can find a certain congruence on finite partial algebras in polynomial time. (b) Let Q* be the relational class determined by Q. If any universal Horn class between the universal closure S(Q*) and the weak embedding closure S(Q*) of Q...
متن کاملPolynomial-time Word Problems
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these results follow from observing that automorphisms of the free group strongly resemble straight line programs, which are widely studied in the theory of compressed d...
متن کاملA ug 2 00 6 POLYNOMIAL - TIME WORD PROBLEMS
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these results follow from observing that automorphisms of the free group strongly resemble straight line programs, which are widely studied in the theory of compressed d...
متن کاملBarbosa, Uniform Polynomial Time Bounds, and Promises
This note is a commentary on, and critique of, André Luiz Barbosa’s paper entitled “P != NP Proof.” Despite its provocative title, what the paper is seeking to do is not to prove P 6= NP in the standard sense in which that notation is used in the literature. Rather, Barbosa is (and is aware that he is) arguing that a different meaning should be associated with the notation P 6= NP, and he claim...
متن کاملPolynomial Time Recognition of Uniform Cocircuit Graphs
We present an algorithm which takes a graph as input and decides in polynomial time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Logic Quarterly
سال: 1995
ISSN: 0942-5616,1521-3870
DOI: 10.1002/malq.19950410204